package chap3_11;

import java.util.Arrays;

public class Exer3_11_7 {
    public static void main(String[] args) {
        int[] num = {1, 23, 16, 27, 16, -2, 13, -8, -10, 1};
        int min=num[0];
        for(int i=0;i<num.length;i++){
            if(num[i]<min){
                min=num[i];
            }
        }for(int j=0;j<num.length;j++){
            if(num[j]==min){
                System.out.println("数组中最小的数是"+min+"在数组的第"+(j+1)+"位");
                break;
            }
        }


    }
}
